#include<bits/stdc++.h>

using namespace std;

const int N = 2e5+10;
 
int a[N]; 

void solve()
{
	int n;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
		a[i]=(a[i]+n)%n;
		a[i]=(i+a[i])%n;
	}
	sort(a+1,a+n+1);
	int m=unique(a+1,a+1+n)-(a+1);
	if(n==m)
	cout<<"YES"<<endl;
	else cout<<"NO"<<endl;
}

int main()
{	int t;
	cin>>t;
	while(t--)
	{
		solve();
	}

}
